Geometric Differential Evolution for Combinatorial and Programs Spaces
نویسندگان
چکیده
منابع مشابه
Geometric Differential Evolution for Combinatorial and Programs Spaces
Geometric differential evolution (GDE) is a recently introduced formal generalization of traditional differential evolution (DE) that can be used to derive specific differential evolution algorithms for both continuous and combinatorial spaces retaining the same geometric interpretation of the dynamics of the DE search across representations. In this article, we first review the theory behind t...
متن کاملGeometric Differential Evolution on the Space of Genetic Programs
Geometric Differential Evolution (GDE) is a very recently introduced formal generalization of traditional Differential Evolution (DE) that can be used to derive specific GDE for both continuous and combinatorial spaces retaining the same geometric interpretation of the dynamics of the DE search across representations. In this paper, we derive formally a specific GDE for the space of genetic pro...
متن کاملDifferential Geometric Aspects of Alexandrov Spaces
We summarize the results on the differential geometric structure of Alexandrov spaces developed in [Otsu and Shioya 1994; Otsu 1995; Otsu and Tanoue a]. We discuss Riemannian and second differentiable structure and Jacobi fields on Alexandrov spaces of curvature bounded below or above.
متن کاملDifferential evolution and combinatorial search for constrained index-tracking
Index tracking is a valuable low-cost alternative to active portfolio management. The implementation of a quantitative approach, however, is a great challenge from an optimization perspective: the optimal selection of a group of assets that can replicate the index of a much larger portfolio requires both to find the optimal asset positions and to fine-tune their allocation weights. The former i...
متن کاملGeometric Generalisation of Surrogate Model Based Optimisation to Combinatorial Spaces
In continuous optimisation, Surrogate Models (SMs) are often indispensable components of optimisation algorithms aimed at tackling real-world problems whose candidate solutions are very expensive to evaluate. Because of the inherent spatial intuition behind these models, they are naturally suited to continuous problems but they do not seem applicable to combinatorial problems except for the spe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Evolutionary Computation
سال: 2013
ISSN: 1063-6560,1530-9304
DOI: 10.1162/evco_a_00099